Producing a Top-Down Parse Order with Bottom-up Parsing
نویسندگان
چکیده
An adaptation of the standard LR(1) and LALR(1) parsing algorithm is described such that a top-down parse order is produced rather than the standard bottom-up order. This work was supported by the Natural Sciences and Engineering Research Council of Canada, the Information Technology Research Centre of Ontario and Queen's University at Kingston. James Schmeiser is a developer in the IBM Canada Laboratory C/C++ compiler group. The paper was completed while the second author was on sabbatical at INRIA (Institut National de Recherche en Informatique et en Automatique), Rocquencourt, France.
منابع مشابه
In-Order Transition-based Constituent Parsing
Both bottom-up and top-down strategies have been used for neural transition-based constituent parsing. The parsing strategies differ in terms of the order in which they recognize productions in the derivation tree, where bottom-up strategies and top-down strategies take post-order and pre-order traversal over trees, respectively. Bottom-up parsers benefit from rich features from readily built p...
متن کاملEfficient Bottom-Up Parsing
This paper describes a series of experiments aimed at producing a bot tom-up parser that will produce partial parses suitable for use in robust interpretation and still be reasonably efficient. In the course of these experiments, we improved parse times by a factor of 18 over our first a t tempt, ending with a system that was twice as fast as our previous parser, which relied on strong top-down...
متن کاملA Fast, Accurate Deterministic Parser for Chinese
We present a novel classifier-based deterministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make shift-reduce decisions. Trained and evaluated on the standard training and test sets, our best model (using stacked classifiers) runs in linear time and has labeled precision and recall above 88% using gold-standard p...
متن کاملParsing incomplete sentences
An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts of unknown length. It produces in finite form all possible parses (often infinite in number) that could account for the missing parts. The algorithm is a variation on the construction due to Earley. However, its presentation is such that it can readily be adapted to any chart parsing schema (top...
متن کاملLLLR Parsing: a Combination of LL and LR Parsing
A new parsing method called LLLR parsing is defined and a method for producing LLLR parsers is described. An LLLR parser uses an LL parser as its backbone and parses as much of its input string using LL parsing as possible. To resolve LL conflicts it triggers small embedded LR parsers. An embedded LR parser starts parsing the remaining input and once the LL conflict is resolved, the LR parser p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 54 شماره
صفحات -
تاریخ انتشار 1995